SEARCH RESULT

Year

Subject Area

Broadcast Area

Document Type

Language

4 results listed

2018 Artificial Atom Algorithm in Image Processing Applications

In this study, Artificial Atom Algorithm, which is a new meta-heuristic algorithm approach, have been used to calculate the threshold value which is frequently performed in image processing applications. The entropy-based method has been adopted for the target function which is common in the meta-heuristic algorithms. For this aim, Shannon entropy and a new entropy method, Fractional Order Entropy, have been used. It is seen on standard test images that the Artificial Atom Algorithm can be applied to image processing applications. In addition, the results of the application were supported by comparing the values produced by certain parameters of fractional entropy with the values produced by Shannon Entropy.

International Conference on Advanced Technologies, Computer Engineering and Science
ICATCES

Burak Açma Emine Çiftçi Burhan Selcuk

390 277
Subject Area: Computer Science Broadcast Area: International Type: Oral Paper Language: English
2018 Parallel Artificial Atom Algorithm for Large Scale Travelling Salesman Problem

Optimization algorithms yield acceptable results in the shortest time, even if they cannot always guarantee the best end result in the given problem. There are classical mathematical methods and meta-heuristic methods that have become very popular for solving optimization problems. Meta-heuristic algorithms can be categorized in many type such as physics based, social based, biological based, chemistry based, sport based, swarm based, mathematics based and also hybrid based. In this study, the Artificial Atom Algorithm (A3) is applied in parallel to solve the Traveling Salesman Problem (TSP). A3 is chemistrybased technique that is improved by inspired the compounding process of atoms and the application of parallel A3 is particularly easy and promises significant gains in performance especially for large scale TSP. TSP is one of the route planning problems that finds the lowest cost path of visiting all the cities on the giving map and returns to starting point, it was aimed to plan the best route. The performance of algorithm in terms of the city number, the route distance and the calculation time of this route will be examined. An interface will be designed to implement the application and observe the experimental results.

International Conference on Advanced Technologies, Computer Engineering and Science
ICATCES

Ayşe Nur Altintaş Tankül Burhan Selcuk

406 549
Subject Area: Computer Science Broadcast Area: International Type: Oral Paper Language: English
2019 Empati Çıkar Yöntemiyle Akademik Çalışma Gruplarının İncelenmesi

Bu çalışmada akademisyenlerin yayınları kullanılarak yayından yazara birliktelik analizi yapılmış ve akademik çalışma grupları oluşturulmaya çalışılmıştır. Yayınların başlık, anahtar kelime, özetlerinde geçen kelimeler morfolojik olarak köklerine ayrılmış, metinsel temizleme yapılmış ve Empati-Çıkar yöntemi kullanılarak benzerlik/yakınlık katsayıları hesaplanmıştır. Oluşan benzerlik/yakınlık matrisi kullanılarak yayında katkısı bulunan yazarlar yakınlıklarına göre çalışma gruplarına dahil edilmeye çalışılmıştır.

International Data Science & Engineering Symposium
IDSES

Ömer Faruk ACAR Burhan Selcuk

265 168
Subject Area: Engineering Broadcast Area: International Type: Oral Paper Language: English
2018 Birliktelik Analizinde Yeni Bir Yaklaşım: Empati – Çıkar Yöntemi

Bu çalışmada, Türkçe yayınlanan akademik makaleler arasındaki birliktelik analizi incelenmiştir. Makalelerdeki anahtar kelimeler, başlıklar ve özetler için empati-çıkar yöntemi kullanılmıştır ve böylece diğer yöntemlerden daha hızlı ve etkili bir şekilde ortak çalışma grupları elde edilmiştir.

Akademik Bilişim
AB

Ömer Faruk ACAR Burhan Selcuk

236 168
Subject Area: Computer Science Broadcast Area: National Type: Oral Paper Language: Turkish